Complexity and algorithms for copy-number evolution problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Copy-Number Evolution Problems: Complexity and Algorithms

Cancer is an evolutionary process characterized by the accumulation of somatic mutations in a population of cells that form a tumor. One frequent type of mutations are copy number aberrations, which alter the number of copies of genomic regions. The number of copies of each position along a chromosome constitutes the chromosome’s copy-number profile. Understanding how such profiles evolve in ca...

متن کامل

Quantum Algorithms and Complexity for Numerical Problems

Quantum Algorithms and Complexity for Numerical Problems

متن کامل

Complexity and algorithms for nonlinear optimization problems

Nonlinear optimization algorithms are rarely discussed from a complexity point of view. Even the concept of solving nonlinear problems on digital computers is not well defined. The focus here is on a complexity approach for designing and analyzing algorithms for nonlinear optimization problems providing optimal solutions with prespecified accuracy in the solution space. We delineate the complex...

متن کامل

Algorithms and Complexity for Continuous Problems

From 23.09.12 to 28.09.12, the Dagstuhl Seminar 12391 Algorithms and Complexity for Continuous Problems was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar can be found in this report. The...

متن کامل

Algorithms and Complexity for Continuous Problems

s of Talks (in alphabetical order by speaker’s surname) Probabilistic Analysis of Interior Point Methods for Linear Programming Karl Heinz Borgwardt joint work with Petra Huhn It is our aim to make a fair comparison of the Simplex Method and Interior Point Methods on the basis of their average case behavior in the solution of Linear Programming problems possible. Therefore we use the same stoch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithms for Molecular Biology

سال: 2017

ISSN: 1748-7188

DOI: 10.1186/s13015-017-0103-2